Parametric Integer Programming in Fixed Dimension
نویسندگان
چکیده
منابع مشابه
Parametric Integer Programming in Fixed Dimension
We consider the following problem: Given a rational matrix A ∈ Qm×n and a rational polyhedron Q ⊆ Rm+p, decide if for all vectors b ∈ Rm, for which there exists an integral z ∈ Zp such that (b,z) ∈ Q, the system of linear inequalities Ax 6 b has an integral solution. We show that there exists an algorithm that solves this problem in polynomial time if p and n are fixed. This extends a result of...
متن کاملFast Integer Programming in Fixed Dimension
It is shown that the optimum of an integer program in fixed dimension with a fixed number of constraints can be computed with O(s) basic arithmetic operations, where s is the binary encoding length of the input. This improves on the quadratic running time of previous algorithms, which are based on Lenstra’s algorithm and binary search. It follows that an integer program in fixed dimension, whic...
متن کاملParametric Integer Programming
When analysing computer programs (especially numerical programs in which arrays are used extensively), one is often confronted with integer programming problems. These problems have three peculiarities: feasible points are ranked according to lexicographic order rather than the usual linear economic function; the feasible set depends on integer parameters; one is interested only in exact soluti...
متن کاملInteger Polynomial Optimization in Fixed Dimension
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an integer polynomial over the lattice points of a convex polytope, we show an algorithm to compute lower and upper bounds for the optimal value. For polynomials t...
متن کاملA Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader’s variables are continuous, our algorithm also detects whether the infimum cost fail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2008
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1080.0320